DAG-Pathwidth: Graph Algorithmic Analyses of DAG-Type Blockchain Networks

Self-Stabilizing Algorithms in DAG Structured Networks

This paper describes a parameterised protocol applicable to directed acyclic graph (DAG ) topologiesThe function parameter of the protocol is instantiated twice to design two specific protocols: (i) the topological sorting of the successor list at every node, and (ii) a shortest path routing table constructionBoth protocols are self-Stabilizing and thus they are resilient to transient failures ...

On maximum spanning DAG algorithms for semantic DAG parsing

Consideration of the decoding problem in semantic parsing as finding a maximum spanning DAG of a weighted directed graph carries many complexities that haven’t been fully addressed in the literature to date, among which are its actual appropriateness for the decoding task in semantic parsing, not to mention an explicit proof of its complexity (and its approximability). In this paper, we conside...

Beware of the DAG!

Directed acyclic graph (DAG) models are popular tools for describing causal relationships and for guiding attempts to learn them from data. In particular, they appear to supply a means of extracting causal conclusions from probabilistic conditional independence properties inferred from purely observational data. I take a critical look at this enterprise, and suggest that it is in need of more, ...

A Review of Multiprocessor Directed Acyclic Graph (DAG) Scheduling Algorithms

Scheduling parallel tasks on multiprocessor systems is to allocate a set of tasks to processors such that the optimal usage of processors and accepted computation time for scheduling algorithm are obtained. In multiprocessor systems, an efficient scheduling of a parallel program onto the processors that minimizes the entire execution time is vital for achieving a high performance. The need for ...

Scheduling DAG Structured Computations